Volume and duration of losses in finite buffer fluid queues

Infinite- and Finite-buffer Markov Fluid Queues: a Unified Analysis

In this paper, we study Markov fluid queues where the net fluid rate to a single-buffer system varies with respect to the state of an underlying continuous-time Markov chain. We present a novel algorithmic approach to solve numerically for the steady-state solution of such queues. Using this approach, both infiniteand finite-buffer cases are studied. We show that the solution of the infinite-bu...

Finite-Buffer Queues with Workload-Dependent Service and Arrival Rates

We consider M/G/1 queues with workload-dependent arrival rate, service speed, and restricted accessibility. The admittance of customers typically depends on the amount of work found upon arrival in addition to its own service requirement. Typical examples are the finite dam, systems with customer impatience and queues regulated by the complete rejection discipline. Our study is motivated by que...

Analysis of Pareto-Type/M/s/c finite buffer queues

The finding that Pareto distributions are adequate to model Internet packet interarrival times has motivated the proposal of methods to compute steady-state performance measures of Pareto/M/·/· queues. In this work we give an overview of some of these methods and compare them with an approach we have recently proposed, which combines embedding, uniformization and stochastic ordering techniques ...

Extremes and fluid queues

LOSSES IN M/GI/m/n QUEUES

The M/GI/m/n queueing system with m homogeneous servers and the finite number n of waiting spaces is studied. Let λ be the customers arrival rate, and let μ be the reciprocal of the expected service time of a customer, where λ = mμ. The paper proves that under this assumption the expected number of losses during a busy period remains the same for all n ≥ 1, while in the particular case of the M...